Cosa (chi) è head normal form - definizione
POTENTIAL STATE FOR A TERM IN LAMBDA CALCULUS
Beta-eta normal form; Head normal form; Beta redex
Head Normal Form
<theory, reduction> (HNF) A term describing a {lambda
expression} whose top level is either a variable, a data
value, a built-in function applied to too few arguments, or a
lambda abstraction whose body is not reducible. I.e. the
top level is neither a redex nor a lambda abstraction with a
reducible body.
An expression in HNF may contain redexes in argument postions
whereas a normal form may not.
Compare Weak Head Normal Form.
(2003-01-08)
Beta normal form
In the lambda calculus, a term is in beta normal form if no beta reduction is possible. A term is in beta-eta normal form if neither a beta reduction nor an eta reduction is possible.
Third normal form
NORMALIZING A DATABASE DESIGN TO REDUCE THE DUPLICATION OF DATA AND ENSURE REFERENTIAL INTEGRITY
3NF; Third Normal Form; 3rd normal form
Third normal form (3NF) is a database schema design approach for relational databases which uses normalizing principles to reduce the duplication of data, avoid data anomalies, ensure referential integrity, and simplify data management. It was defined in 1971 by Edgar F.
Wikipedia
Beta normal form
In the lambda calculus, a term is in beta normal form if no beta reduction is possible. A term is in beta-eta normal form if neither a beta reduction nor an eta reduction is possible. A term is in head normal form if there is no beta-redex in head position. The normal form of a term, if one exists, is unique (as a corollary of the Church–Rosser theorem). However, a term may have more than one head normal form.
